Block oriented digital communication system and method

ABSTRACT

A method and system for estimating a time shift required for symbol synchronization in a block oriented digital communication systems such as an orthogonal frequency division multiplexing (OFDM) or a discrete multi-tone (DMT) data transmission system. The method uses an N/d inverse discrete Fourier transform (IDFT), where N is a sample number and d is a decimation factor, or alternatively an N/(2 d ) inverse fast Fourier transform (IFFT) for a real received signal or an N/d IDFT for a complex received signal.

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This is the first application filed for the present invention.

TECHNICAL FIELD

[0002] This invention pertains to symbol acquisition and synchronization for block oriented digital communication systems such as orthogonal frequency division multiplexing (OFDM) or discrete multi-tone (DMT) data transmission systems.

BACKGROUND OF THE INVENTION

[0003] In order to properly receive a block oriented digital communication signal, such as orthogonal frequency division multiplexed (OFDM) or discrete multi-tone (DMT) that has been transmitted across a channel, and demodulate the symbols from the received signal, a receiver must determine the timing of the beginning of each symbol within a data frame. If the correct timing is not determined, sequences of symbols demodulated from the received signal will more likely be incorrect, resulting in the transmitted data bits not being correctly recovered.

[0004] Also, OFDM and DMT are often used in hostile environments such as networks deployed over home power lines where interference from narrow-band jamming signals can be problematic.

[0005] There is therefore a need for a computationally efficient system and method for detecting a time shift required for symbol synchronization of an OFDM or DMT signal that allows a simple means of eliminating narrow-band jamming signals.

SUMMARY OF THE INVENTION

[0006] It is an object of the invention to provide a computationally efficient system and method for detecting a time shift required for symbol synchronization of an OFDM or DMT signal that allows a simple means of eliminating narrow-band jamming signals.

[0007] Therefore, according to an aspect of the invention there is provided a method for estimating a time shift required for symbol synchronization in a block oriented digital communication system for receiving PHY symbols. The method includes the steps of sampling a received real signal, performing an N point discrete Fourier transform (DFT), multiplying by a complex conjugate of a DFT of a synch symbol, multiplying by a window of length N/(2d) where d is a decimation factor, shifting, forming a conjugate symmetric spectrum, performing an N/d inverse DFT (IDFT), and estimating the time shift required for symbol synchronization by detecting a position in time of a peak value.

[0008] According to another aspect of the invention there is provided a method for estimating a time shift required for symbol synchronization in a block oriented digital communication system for receiving PHY symbols. The method includes the steps of sampling a received complex signal, performing an N point discrete Fourier transform (DFT), multiplying by a complex conjugate of a DFT of a synch symbol, multiplying by a window of length N/(d) where d is a decimation factor, shifting, performing an N/d inverse DFT (IDFT), and estimating the time shift required for symbol synchronization by detecting a position in time of a peak value.

[0009] According to yet another aspect of the invention there is provided block oriented digital communication system for receiving PHY symbols, including means for sampling a received real signal, means for performing an N point discrete Fourier transform (DFT), means for multiplying by a complex conjugate of a DFT of a synch symbol, means for multiplying by a window of length N/(2d) where d is a decimation factor, means for shifting, means for forming a conjugate symmetric spectrum, means for performing an N/d inverse DFT (IDFT), and means for estimating a time shift required for symbol synchronization.

[0010] According to still another aspect of the invention there is provided block oriented digital communication system for receiving PHY symbols, including means for sampling a received complex signal, means for performing an N point discrete Fourier transform (DFT), means for multiplying by a complex conjugate of a DFT of a synch symbol, means for multiplying by a window of length N/ (d) where d is a decimation factor, means for shifting, means for performing an N/d inverse DFT (IDFT), and means for estimating a time shift required for symbol synchronization.

BRIEF DESCRIPTION OF THE DRAWINGS

[0011] Further features and advantages of the present invention will become apparent from the following detailed description, taken in combination with the appended drawings, in which:

[0012]FIG. 1 is a plot of a correlation of a sampled received signal with a synch symbol;

[0013]FIG. 2 is a block diagram of a conventional time shift detector of a block oriented digital communication system;

[0014]FIG. 3 is a schematic representation of a PHY symbol and timing relationships of an alignment window with respect to the PHY symbol;

[0015]FIG. 4 is a plot of an example of the PHY symbol of FIG. 3;

[0016]FIGS. 5A and 5B are respective parts of a block diagram of a time shift detector in accordance with the invention;

[0017]FIG. 6 is a plot of a receive signal having 6 repetitions of a typical synch symbol;

[0018]FIG. 7 is a plot of an impulse response of a channel;

[0019]FIG. 8 is plot of y(n) shown in FIG. 2;

[0020]FIG. 9 is a plot of a modulus of Y(k) shown in FIGS. 2 and 5A; and

[0021]FIG. 10 is a plot of x(n) shown FIG. 5B.

[0022] It will be noted that throughout the appended drawings, like features are identified by like reference numerals.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

[0023] Orthogonal frequency domain modulation (OFDM) and discrete multi-tone (DMT) are block oriented digital communication systems where a block of complex information bearing symbols (an information block) is encoded onto a transmit waveform consisting of a superposition of sinusoidal signals. This waveform lasts for a period of time referred to as a PHY symbol. Subsequent information blocks are transmitted in subsequent PHY symbols. The component sinusoidal signals are often referred to as sub-carriers or tones. Many such systems transmit a short synchronization burst prior to transmitting a series of PHY symbols bearing data. The synchronization signal typically consists of the periodic repetition of a predetermined PHY symbol. This predetermined PHY symbol is referred to as a synch symbol. Symbol acquisition and synchronization can be achieved by performing a running correlation of the sampled received signal with the synch symbol. When a correlation window passes over the synchronization burst, the output is a series of spikes that occur each time the window aligns properly with the PHY symbol. FIG. 1 shows a plot 100 of a typical output 106 of such a correlator. In this example there are 6 repetitions of the synch symbol and thus six distinct correlation peaks 108. An x-axis 102 represents time and a y-axis 104 represents the correlator output.

[0024] In DMT or OFDM systems, the information bearing symbols can be retrieved by performing a discrete Fourier transform (DFT) on the sampled PHY symbols and then performing an equalization by dividing each DFT output by a complex channel estimate. The channel estimate is commonly obtained by comparing the known DFT output of the transmitted synch symbol to the DFT output of the received synch symbol.

[0025]FIG. 2 shows a block diagram 200 of a conventional time shift detector of a block oriented digital communication system. A circular correlation operation is performed between two N-sample long sequences: an N-point sampled sequence u(n) 204 of a received signal 202 from an analog-to-digital (A/D) converter 203 connected to a channel 201 and a synch signal, s(n) (not shown). An N-point sequence S*(k) 214 is a complex conjugate of a DFT of the synch signal, s(n), is predetermined and stored in a memory 212. A DFT 206 of u(n) 204 is performed producing an N-point sequence, U(k) 208, representing a conjugate symmetric spectrum of u(n) 204. A point by point complex product 210 of U(k) 208 and S*(k) 214, produces Y(k) 216. Y(k) 216 is a series of N tones. Then an inverse DFT (IDFT) 218 is performed on Y(k) 216 producing y(n) 220 which is a circular correlation of u(n) 204 with s(n) (not shown). y(n) 220 is an approximation of a sampled impulse response of the channel 201. This is more efficient than performing a direct correlation if computationally efficient fast Fourier transform (FFT) and inverse FFT (IFFT) algorithms are employed instead of DFT 206 and IDFT 218 respectively. A peak detector 222 determines a time shift 224 of u(n) 204 by detecting peaks in y(n) 220. The time shift 224 is used by a symbol acquisition system 226 to synchronize and acquire PHY symbols.

[0026] A linear correlation of the signal s(n) of duration N with a periodic signal u(n) 204 of period N will yield exactly the same result as a circular correlation of s(n) with one N sample long period of u(n) 204. Therefore, in the case of the periodic synchronization burst, it is quite acceptable to perform a series of circular correlations rather than a linear correlation. Since a DMT receiver requires a DFT operation for data demodulation and since a transform method of correlation is computationally efficient, it makes sense to use it for DMT or OFDM systems. An additional advantage of using a DFT based correlator is that it provides a simple way of dealing with narrow-band jamming signals. After the DFT has been performed, the effect of narrow-band jamming signals will be limited to a few tones centered around the jamming frequency. These tones can simply be set to zero prior to any further processing.

[0027]FIG. 3 shows a schematic representation 300 of a PHY symbol 304 and timing relationships 320 of an alignment window 322 with respect to the PHY symbol 304. In DMT or OFDM systems, the PHY symbol 304 is usually transmitted with a cyclic prefix 310. The cyclic prefix 310 is a periodic extension of a PHY symbol 308 whereby n_(g) samples 314 from the end of the PHY symbol 308 are copied 312 and prefixed to the PHY symbol 308 to create the n_(g)+N sample long PHY symbol 304.

[0028] A benefit of using a cyclic prefix 310 is that it is no longer necessary to ideally align 332 the N samples that are input to the receiver DFT exactly with an N sample long symbol 308. If an impulse response 302 of the channel 201 is n_(h) samples long 324 and if n_(h)<n_(g) then the alignment window 322 can be anywhere within an N+n_(g)−n_(h) range 328 bracketed by an earliest symbol alignment window 326 for no inter-symbol interference (ISI) and a latest symbol alignment window 332 having an allowable error 330 of n_(g)−n_(h). Hence, equalization can be achieved. This means that in the absence of noise, equalized data symbols will exactly match information bearing symbols.

[0029]FIG. 4 shows a plot 400 of an example of the PHY symbol 304 shown in FIG. 3 including the n_(g) sample prefix 310, the N sample symbol 308 having the n_(g) samples 314 at the end of the N sample symbol 308. An x-axis 402 represents time and a y-axis 404 represents a voltage of the received signal 202.

[0030] In accordance with a preferred embodiment of the invention the allowable error 330 in symbol alignment (FIG. 3) is leveraged to advantage by using an approximation to the circular correlation operation described with reference to FIG. 2, to reduce complexity in the IDFT operation 218.

[0031]FIGS. 5A and 5B show an embodiment of a time shift detector 500 in accordance with the present invention, wherein the channel 201, the received signal 202, the A/D converter 203, u(n) 204, the N-point DFT 206, U(K) 208, the memory 212, S*(k) 214, the complex multiplier 210, Y(k) 216, peak detector 222, and symbol timing adjust 226 are identical to those shown in FIG. 2.

[0032] A value of k₁ is chosen such that indices of a contiguous set of tones of Y(k) 216 having a highest average signal power are designated by k=k₁:k₁+N/(2d)−1 where d is a decimation factor. Alternatively, a value of k₁ may be chosen such that indices of a contiguous set of tones of Y(k) 216 having a highest average signal-to-noise ratio are designated by k=k₁:k₁+N/(2d)−1. Y(k) 216 is then multiplied 502 by a rectangular window of length N/(2d) from k₁ to k₁+N/(2d)−1 to produce Y′ (k) 504. This is equivalent to performing a circular convolution of the sequence y(n) 220 with a DFT of the window. This smoothes and slightly spreads the sequence x(n) 516 but does not significantly change the relative magnitude and locations of peaks because the DFT of the rectangular window is a fairly localized function. Alternatively, the window may be, for example, a Hamming, Hanning, Blackman, Bartlett, or Kaiser window.

[0033] The windowed spectrum Y′ (k) 504 is then shifted 506 by k₁ samples. This is equivalent to multiplying the smoothed version of y(n) 220 by a complex exponential factor. This phase shifts each point but does not alter the magnitude.

[0034] Then an N/d point conjugate symmetric spectrum is formed 510 from Y″ (k) 508: ${X(k)} = \left\{ \begin{matrix} {{Re}\left\{ {Y\left( k_{1} \right)} \right\}} & {k = 0} \\ {Y\left( {k_{1} + k} \right)} & {k = {1:{{{N/2}d} - 1}}} \\ 0 & {k = {{N/2}d}} \\ {Y*\left( {k_{1} + {N/d} - k} \right)} & {k = {{{{N/2}d} + 1}:{{N/d} - 1}}} \end{matrix} \right.$

[0035] At this point it is possible take an N-point IDFT of the windowed, shifted, conjugate symmetric spectrum and that produces an N-point approximation to the function y(n) 220. For the purpose of explanation, designate the windowed, shifted, conjugate symmetric spectrum as V(k) An N-point IDFT of V(k) is: ${v(n)} = {{\sum\limits_{k = 0}^{N - 1}{{V(k)}W_{N}^{- {kn}}\quad W_{N}}} = ^{{- {j2\pi}}/N}}$

[0036] However, because of the windowing 502, the only non-zero terms of this sum are: ${v(n)} = {{\sum\limits_{k = 0}^{{{N/2}d} - 1}{{V(k)}W_{N}^{- {kn}}}} + {\sum\limits_{k = {N - {{N/2}d}}}^{N - 1}{{V(k)}W_{N}^{- {kn}}}}}$

[0037] Now with a change of variable in the second sum and decimating the sequence v(n) by a factor of d, there is: ${v\left( {d\quad n} \right)} = {{\sum\limits_{k = 0}^{{{N/2}d} - 1}{{V(k)}W_{N}^{- {dkn}}}} + {\sum\limits_{k = {{N/2}d}}^{{N/d} - 1}{{V\left( {k + N - {N/d}} \right)}W_{N}^{- {dkn}}}}}$

[0038] The samples of V(k) included in the sum above are the equal to X(k) 512, that is:

V(k)=X(k) k=0:N/2d −1

V(k+N−N/d)=X(k) k=N/2d:N d−1

[0039] Therefore: ${v\left( {d\quad n} \right)} = {{\sum\limits_{k = 0}^{{N/d} - 1}{{X(k)}W_{N/d}^{- {kn}}}} = {x(n)}}$

[0040] Then an N/d point IDFT 514 is performed to produce x(n) 516. This is an approximation to a decimation by d of the output sequence y(n) 220 (FIG. 2) that would have been obtained using the N-point IDFT 218.

[0041] A peak detector 222 then produces a time shift 524 for the symbol timing adjust 226. This approximation preserves the general shape of the impulse response estimate 302 and is sufficient to obtain synchronization within the allowable error 330 (FIG. 3) for a DMT or OFDM system having a cyclic prefix 310. It is well known in the art that if the decimation factor d is chosen so that N/d is a power of 2, then the IDFT operation 514 can be performed using an IFFT algorithm.

[0042] In order to further describe the invention, an example of the process shown in FIG. 2 is presented using the N-point IDFT 218, and then an example of the process shown in FIG. 5 using the N/d point IDFT 514 is described.

[0043]FIG. 6 is a plot 600 of the received signal 202 having 6 repetitions 608 of a typical synch symbol with a noise signal added (to simulate realistic conditions) wherein an x-axis 602 represents time and a y-axis 604 a voltage of the received signal 202.

[0044]FIG. 7 is a plot 700 of the impulse response 302 of the channel 201 having a length of n_(h) 324 wherein an x-axis 702 represents time and a y-axis 704 represents a voltage of the impulse response 302.

[0045]FIG. 8 shows a plot 800 of y(n) 220, the output of the N-point IDFT 218 after performing the operations of FIG. 2 wherein an x-axis 802 represents time and a y-axis 804 represents a value of y(n) 220. It can be seen that this is a noisy version of the impulse response 302 (FIG. 7) and that the current window 322 can be shifted by a time shift 224 of about 1.1 micro-seconds to align the current window 322 with the latest window position 332.

[0046]FIG. 9 is a plot 900 of the modulus of the product Y(k)=U(k)S*(k) 906 where U(k) 208 is a DFT of the received time sequence u(n) 204 and S*(k) 214 is a complex conjugate of a DFT of the synch signal and wherein an x-axis 902 represents frequency and a y-axis 904 represents a modulus of Y(k) 906. Since the received signal 202 is real, a spectrum of the received signal has conjugate symmetry i.e. Y(k)=Y*(N−k). Therefore, although the duration of the DFT is N=256, the plot 900 only shows the samples for k=0:127 because the remaining samples are just a mirror image of those plotted.

[0047] The N/d point series x(n) 516 (FIG. 5) is an approximation of a decimation by d of the series y(n) 200. FIG. 10 shows a plot 1000 of x(n) 516 after performing the operations of FIGS. 5A and 5B with a decimation factor d=2 wherein an x-axis 1002 represents time and a y-axis represents a value of x(n) 516. Thus, x(n) 516 is a decimated by 2 approximation to y(n) 220 of FIG. 8. A peak in the decimated output shows that the current window 322 can be shifted by a time shift 524 of about 1.1 micro-seconds to align the current window 322 with the latest window position 332. This time shift 524 is very close to the time shift 224 obtained with the full 256-point IDFT 218.

[0048] It should be noted that an optimum value for the symbol timing correction may not necessarily be determined by the sample in the series x(n) 516 with the largest absolute value. Additional processing techniques such as searching for the peak in the smoothed or filtered absolute value of x(n) 516 may yield a more representative value.

[0049] The above description addresses a baseband system wherein the received signal 202 is real. It is therefore preferable to perform an N point DFT 206 of u(n) 204 and an N/d point IDFT 514 of X(k) 512 using an N/2 point DFT and N/(2d) point IDFT respectively as described below.

[0050] Start with the series u(n) 204 of length N. Form a complex series:

u _(c)(n)=u(2n)+ju(2n+1) n=O:N/2−1

[0051] Now define U,(k) to be the N/2 point DFT of u_(c)(n) The DFT of u(n), U(k) 208, will be: $\begin{matrix} {{{U(k)} = {\frac{1}{2}\left\lbrack {{U_{c}(k)} + {U_{c}^{*}\left( {{N/2} - k} \right)} - {j\quad {W_{N}^{k}\left( {{U_{c}(k)} - {U_{c}^{*}\left( {{N/2} - k} \right)}} \right)}}} \right\rbrack}}\quad} & {k = {0:{{N/2} - 1}}} \\ {{U(k)} = {\frac{1}{2}\left\lbrack {{U_{c}(0)} + {U_{c}^{*}(0)} - {j\left( {{U_{c}(0)} - {U_{c}^{*}(0)}} \right)}} \right\rbrack}} & {K = {N/2}} \end{matrix}$

U(k)=U*(N−k) k−N/2+1:N−1

[0052] where W_(N)=e^(−j2π/N).

[0053] Since X(k) 512 (as in paragraph 0 above) is a conjugate symmetric spectrum, an N/d point IDFT 514 of X(k) 512 can be determined by forming a sequence: ${X_{c}(k)} = {{{\frac{1}{2}\left\lbrack {{X(k)} + {X^{*}\left( {{N/2} - k} \right)} + {j\quad {w_{N}^{- k}\left( {{X(k)} - {X^{*}\left( {{N/2} - k} \right)}} \right)}}} \right\rbrack}\quad k} = {0:{{N/\left( {2d} \right)} - 1}}}$

[0054] Then compute x_(c)(n), an N/(2d) point IDFT of X_(c)(k). Even and odd points of x(n) 516 are the real and imaginary parts of x_(c)(n) respectively.

[0055] The above description is related to a conventional DMT receiver that computes a DFT of a received time series. A well know weakness of the DFT is that an unwanted narrow-band interfering signal can affect several DFT outputs in a vicinity of the interfering signal frequency. This effect can be minimized by pre-summing weighted time samples from the cyclic prefix 310 with weighted samples from the end of the PHY symbol 314. This can be done in such a way that it doesn't affect the desired signal. The reduced complexity correlation technique described above also works when this type of pre-summing is used.

[0056] In radio frequency (RF) modulated systems the received signal 202 is a complex signal formed from the in-phase and quadrature components of a received RF signal. In this case the correlation output is a complex sequence and the symbol alignment is achieved by searching for a peak in the modulus of the complex signal. A decimated sequence is obtained by performing an N/d point IDFT using N/d contiguous tones with the largest energy. There is no need to form a conjugate symmetric spectrum.

[0057] The present invention therefore provides a system and method that is computationally efficient, has a simple means of eliminating narrow-band jamming signals and benefits from the reduced complexity of an N/d point IFFT.

[0058] The embodiment of the invention described above is intended to be exemplary only. The scope of the invention is therefore intended to be limited solely by the scope of the appended claims. 

We claim:
 1. A method for estimating a time shift required for symbol synchronization in a block oriented digital communication system for receiving PHY symbols, the method comprising steps of: producing a first sequence (u(n)) by sampling a received real signal N times over a duration of one PHY symbol; producing a second sequence (U(k)) by performing an N point discrete Fourier transform (DFT) on u(n); producing a third sequence (Y(k)) by multiplying U(k) by a fourth sequence (S*(k)) comprising a complex conjugate of a DFT of a synch symbol; producing a fifth sequence (Y′ (k)) by multiplying Y(k) by a window of length N/(2d) from k₁ to k₁+N/(2d)−1 where d is a decimation factor and 0≦k₁≦N/2−N/(2d); producing a sixth sequence (Y″ (k)) by shifting Y′ (k) by k₁ samples; producing a seventh sequence (X(k)) by forming a conjugate symmetric spectrum from Y″ (k); producing a eighth sequence (x(n)) by performing an N/d inverse DFT (IDFT) of X(k); and estimating the time shift required for symbol synchronization by detecting a position in time of a peak value in x(n).
 2. A method as claimed in claim 1 wherein d is chosen such that N/d is a power of
 2. 3. A method as claimed in claim 2 wherein the IDFT is an inverse fast Fourier transform (IFFT).
 4. A method as claimed in claim 1 wherein a type of the window is selected from the group consisting of rectangular, Hamming, Hanning, Blackman, Bartlett and Kaiser.
 5. A method as claimed in claim 1 further comprising a step of choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(2d)−1 of Y(k) is a set of tones having a highest average signal power.
 6. A method as claimed in claim 1 further comprising a step of choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(2d)−1 of Y(k) is a set of tones having a highest average signal-to-noise ratio.
 7. A method as claimed in claim 1 further comprising a step of setting a tone of Y(k) to zero.
 8. A method as claimed in claim 1 further comprising a step of smoothing x(n).
 9. A method as claimed in claim 1 further comprising a step of producing a filtered absolute value of x(n).
 10. A method as claimed in claim 9 further comprising a step of detecting a position in time of a peak in the filtered absolute value of x(n) relative to an alignment window.
 11. A method as claimed in claim 1 further comprising a step of pre-summing weighted samples from a cyclic prefix with weighted samples of a PHY symbol.
 12. A method as claimed in claim 1 wherein the step of producing the eighth sequence (x(n)) comprises a step of producing a ninth sequence (X_(c)(k)) and performing an N/(2d) point IDFT of X_(c)(k).
 13. A method as claimed in claim 1 further comprising a step of detecting a position in time of a peak value in x(n) relative to an alignment window.
 14. A method for estimating a time shift required for symbol synchronization in a block oriented digital communication system comprising PHY symbols, the method comprising steps of: producing a first sequence (u(n)) of by sampling a received complex signal N times over a duration of one PHY symbol; producing a second sequence (U(k)) by performing an N point discrete Fourier transform (DFT) on u(n); producing a third sequence (Y(k)) by multiplying U(k) by a fourth sequence (S*(k)) comprising a complex conjugate of a DFT of a synch symbol; producing a fifth sequence (Y′ (k)) by multiplying Y(k) by a window of length N/(d) from k₁ to k₁+N/(d)−1 where d is a decimation factor and 0≦k ₁≦N−N/(d); producing a sixth sequence (X(k)) by shifting Y′ (k) by k₁ samples; producing a seventh sequence (x(n)) by performing an N/d inverse DFT (IDFT) of X(k); and estimating the time shift required for symbol synchronization by detecting a position in time of a peak value in x(n).
 15. A method as claimed in claim 14 wherein d is chosen such that N/d is a power of
 2. 16. A method as claimed in claim 15 wherein the IDFT is an inverse fast Fourier transform (IFFT).
 17. A method as claimed in claim 14 wherein a type of the window is selected from the group consisting of rectangular, Hamming, Hanning, Blackman, Bartlett and Kaiser.
 18. A method as claimed in claim 14 further comprising a step of choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(d)−1 of Y(k) is a set of tones having a highest average signal power.
 19. A method as claimed in claim 14 further comprising a step of choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(d)−1 of Y(k) is a set of tones having a highest average signal-to-noise ratio.
 20. A method as claimed in claim 14 further comprising a step of setting a tone of Y(k) to zero.
 21. A method as claimed in claim 14 further comprising a step of smoothing x(n).
 22. A method as claimed in claim 14 further comprising a step of producing a filtered absolute value of x(n).
 23. A method as claimed in claim 22 further comprising a step of detecting a position in time of a peak in the filtered absolute value of x(n) relative to an alignment window.
 24. A method as claimed in claim 14 further comprising a step of pre-summing weighted samples from a cyclic prefix with weighted samples of a PHY symbol.
 25. A method as claimed in claim 14 further comprising a step of detecting a position in time of the peak value in x(n) relative to an alignment window.
 26. A block oriented digital communication system for receiving PHY symbols, comprising: means for producing a first sequence (u(n)) of by sampling a received real signal N times over a duration of one PHY symbol; means for producing a second sequence (U(k)) by performing an N point discrete Fourier transform (DFT) on u(n); means for producing a third sequence (Y(k)) by multiplying U(k) by a fourth sequence (S*(k)) comprising a complex conjugate of a DFT of a synch symbol; means for producing a fifth sequence (Y′ (k)) by multiplying Y(k) by a window of length N/(2d) from k₁ to k₁+N/(2d)−1 where d is a decimation factor and 0≦k₁≦N/2−N/(2d); means for producing a sixth sequence (Y″ (k)) by shifting Y′ (k) by k₁ samples; means for producing a seventh sequence (X(k)) by forming a conjugate symmetric spectrum from Y″ (k) ; means for producing a eighth sequence (x(n)) by performing an N/d inverse DFT (IDFT) of X(k); and means for estimating a time shift required for symbol synchronization by detecting a position in time of a peak value in x(n).
 27. A system as claimed in claim 26 wherein the block oriented digital communication system is an orthogonal frequency division multiplexing (OFDM) system.
 28. A system as claimed in claim 26 wherein the block oriented digital communication system is a discrete multi-tone (DMT) data system.
 29. A system as claimed in claim 26 wherein the PHY symbols comprise cyclic prefixes.
 30. A system as claimed in claim 26 wherein d is chosen such that N/d is a power of
 2. 31. A system as claimed in claim 29 wherein the IDFT is an inverse fast Fourier transform (IFFT).
 32. A system as claimed in claim 26 wherein a type of the window is selected from the group consisting of rectangular, Hamming, Hanning, Blackman, Bartlett and Kaiser.
 33. A system as claimed in claim 26 further comprising means for choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(2d)−1 of Y(k) is a set of tones with a highest average signal power.
 34. A system as claimed in claim 26 further comprising means for choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(2d)−1 of Y(k) is a set of tones with a highest average signal-to-noise ratio.
 35. A system as claimed in claim 26 further comprising means for setting a tone of Y(k) to zero.
 36. A system as claimed in claim 26 further comprising means for smoothing x(n).
 37. A system as claimed in claim 26 further comprising means for producing a filtered absolute value of x(n).
 38. A system as claimed in claim 37 further comprising means for detecting a position in time of a peak in the filtered absolute value of x(n) relative to an alignment window.
 39. A system as claimed in claim 26 further comprising means for pre-summing weighted samples from a cyclic prefix with weighted samples of a PHY symbol.
 40. A system as claimed in claim 26 further comprising means for detecting a position in time of the peak value in x(n) relative to an alignment window.
 41. A system as claimed in claim 26 wherein means for producing the eighth sequence (x(n)) comprises means for producing a ninth sequence (X_(c)(k)) and means for performing an N/(2d) point IDFT of X_(c)(k).
 42. A block oriented digital communication system for receiving PHY symbols, comprising: means for producing a first sequence (u(n)) of by sampling a received complex signal N times over a duration of one PHY symbol; means for producing a second sequence (U(k)) by performing an N point discrete Fourier transform (DFT) on u(n); means for producing a third sequence (Y(k)) by multiplying U(k) by a fourth sequence (S*(k)) comprising a complex conjugate of a DFT of a synch symbol; means for producing a fifth sequence (Y′ (k)) by multiplying Y(k) by a window of length N/(d) from k₁ to k₁+N/(d)−1 where d is a decimation factor and 0≦k₁≦N−N/(d); means for producing a sixth sequence (X(k)) by shifting Y′ (k) by k₁ samples; means for producing a seventh sequence (x(n)) by performing an N/d inverse DFT (IDFT) of X(k); and means for estimating a time shift required for symbol synchronization by detecting a position in time of a peak value in x(n).
 43. A system as claimed in claim 42 wherein the block oriented digital communication system is an orthogonal frequency division multiplexing (OFDM) system.
 44. A system as claimed in claim 42 wherein the block oriented digital communication system is a discrete multi-tone (DMT) data system.
 45. A system as claimed in claim 42 wherein the PHY symbols comprise cyclic prefixes.
 46. A system as claimed in claim 42 wherein d is chosen such that N/d is a power of
 2. 47. A system as claimed in claim 45 wherein the IDFT is an inverse fast Fourier transform (IFFT).
 48. A system as claimed in claim 42 wherein a type of the window is selected from the group consisting of rectangular, Hamming, Hanning, Blackman, Bartlett and Kaiser.
 49. A system as claimed in claim 42 further comprising means for choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(d)−1 of Y(k) is a set of tones having a highest average signal power.
 50. A system as claimed in claim 42 further comprising means for choosing k₁ such that a set of contiguous tones from k₁ to k₁+N/(d)−1 of Y(k) is a set of tones having a highest average signal-to-noise ratio.
 51. A system as claimed in claim 42 further comprising means for setting a tone of Y(k) to zero.
 52. A system as claimed in claim 42 further comprising means for smoothing x(n).
 53. A system as claimed in claim 42 further comprising means for producing a filtered absolute value of x(n).
 54. A system as claimed in claim 53 further comprising means for detecting a position in time of a peak in the filtered absolute value of x(n) relative to an alignment window.
 55. A system as claimed in claim 42 further comprising means for pre-summing weighted samples from a cyclic prefix with weighted samples of a PHY symbol.
 56. A system as claimed in claim 42 further comprising means for detecting a position in time of the peak value in x(n) relative to an alignment window. 